Finite basis problems for stalactic, taiga, sylvester and baxter monoids
نویسندگان
چکیده
In this paper, we show that all stalactic and taiga monoids of rank greater than or equal to 2 are finitely based satisfy the same identities, sylvester identities baxter identities.
منابع مشابه
Deciding conjugacy in sylvester monoids and other homogeneous monoids
Acknowledgements: During the research that led to the this paper, the first author was initially supported by the European Regional Development Fund through the programme and by the PortugueseGovernment through the (Fundação para a Ciência e a Tecnologia) under the project -/// and through an Ciência fellowship, and later supported by an Investigador a...
متن کاملFinite basis problems and results for quasivarieties
Let K be a finite collection of finite algebras of finite signature such that SP (K) has meet semi-distributive congruence lattices. We prove that there exists a finite collection K1 of finite algebras of the same signature, K1 ⊇ K, such that SP (K1) is finitely axiomatizable. We show also that if HS(K) ⊆ SP (K), then SP (K) is finitely axiomatizable. We offer new proofs of two important finite...
متن کاملFinite transducers for divisibility monoids
Divisibility monoids are a natural lattice-theoretical generalization of Mazurkiewicz trace monoids, namely monoids in which the distributivity of the involved divisibility lattices is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations. Here, we show that every divisibility monoid admits an explicit finite transducer which allows to c...
متن کاملOn the Finite Basis Problem for the Monoids of Triangular Boolean Matrices
Let T Bn denote the submonoid of all upper triangular boolean n×n matrices. It is shown by Volkov and Goldberg [6] that T Bn is nonfinitely based if n > 3, but the cases when n = 2, 3 remained open. In this paper, it is shown that the monoid T B2 is finitely based and a finite identity basis for the monoid T B2 is given. Moreover, it is shown that T B3 is inherently nonfinitely based. Hence T B...
متن کاملRewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids
This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and Sylvester monoids. For Chinese monoids, we first give new presentations via finite complete rewriting systems, using more lucid constructions and proofs than those given independently by Chen & Qui and Güzel Karpuz; we then ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2022
ISSN: ['1793-6829', '0219-4988']
DOI: https://doi.org/10.1142/s0219498823502043